A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
نویسندگان
چکیده
منابع مشابه
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
j∈Si d(j, F ) , where for any F ⊆ V , d(j, F ) = minf∈F d(j, f). This is a “min-max” or “robust” version of the k-median problem. Note that in contrast to the recent papers on robust and stochastic problems, we have only one stage of decisionmaking where we select a set of k facilities to open. Once a set of open facilities is fixed, each client in the uncertain client-set connects to the...
متن کاملMin-max-min Geometric Facility Location Problems
We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...
متن کاملA Approximation Algorithms for Min-Max Generalization Problems
We provide improved approximation algorithms for the min-max generalization problems considered by Du, Eppstein, Goodrich, and Lueker [Du et al. 2009]. Generalization is widely used in privacy-preserving data mining and can also be viewed as a natural way of compressing a dataset. In min-max generalization problems, the input consists of data items with weights and a lower bound wlb, and the go...
متن کاملApproximation Algorithms for Facility Location Problems
This paper surveys approximation algorithms for various facility location problems, mostly with detailed proofs. It resulted from lecture notes of a course held at the University of Bonn in the winter term 2004/2005.
متن کاملApproximation algorithms for facility location problems
We present new approximation algorithms for several facility location problems. In each facility location problem that we study, there is a set of locations at which we may build a facility (such as a warehouse), where the cost of building at location i is fi; furthermore, there is a set of client locations (such as stores) that require to be serviced by a facility, and if a client at location ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2010
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1090.0428